Explanation-based repair techniques for solving dynamic scheduling problems
نویسندگان
چکیده
Scheduling problems have been studied a lot over the last decade. Due to the complexity and the variety of such problems, most works consider static problems in which activities are known in advance and constraints are fixed. However, every scheduling problem is subject to unexpected events (consider for example a new activity to schedule, or a machine breakdown). In these cases, a new solution is needed in a preferably short time taking these events into account and as close as possible to the current solution. In this paper, we present an exact approach for solving dynamic scheduling problems. This approach uses explanation-based constraint programming and operational research techniques. Our tools have been designed for a general scheduling problem: the Resource-Constrained Project Scheduling Problem (RCPSP).
منابع مشابه
Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملA Path-Repair Algorithm for Solving Scheduling Problems
Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into one of two main families: local search algorithms and systematic algorithms. Both families have their own advantages, Designing hybrid approaches seem promising since those advantages may be combined into a single approach. In this paper, we propose a new hybrid technique which performs an overall local searc...
متن کاملConstraint Programming for Dynamic Scheduling Problems
Scheduling problems considered in the literature are often static (activities are known in advance and constraints are fixed). However, every real-life schedule is subject to unexpected events. In these cases, a new solution is needed in a preferably short time and as close as possible to the current solution. In this paper, we present an exact approach for solving dynamic Resource-Constrained ...
متن کاملSolving Dynamic Rcpsp Using Explanation-based Constraint Programming
The Resource Constrained Project Scheduling Problem (rcpsp) is a general scheduling problem. It consists of a set of activities and a set of renewable resources. Each resource is available in a given constant amount. Each activity has a duration and requires a constant amount of resource to be processed. Preemption is not allowed. Activities are related by two sets of constraints: temporal cons...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کامل